Admissible Functions and Asymptotics for Labelled Structures by Number of Components

Let a(n; k) denote the number of combinatorial structures of size n with k components. One often has P n;k a(n; k)x y=n! = exp yC(x) , where C(x) is frequently the exponential generating function for connected structures. How does a(n; k) behave as a function of k when n is large and C(x) is entire or has large singularities on its circle of convergence? The Flajolet-Odlyzko singularity analysis does not directly apply in such cases. We extend some of Hayman's work on admissible functions of a single variable to functions of several variables. As applications, we obtain asymptotics and local limit theorems for several set partition problems, decomposition of vector spaces, tagged permutations, and various complete graph covering problems. 1991 AMS Classi cation Numbers. Primary: 05A16 Secondary: 05A18, 15A03, 41A60 the electronic journal of combinatorics 3 (1996), #R34 2